Low-area dual basis divider over GF(2M)
نویسندگان
چکیده
This paper presents a low-area nite eld divider using dual basis representation. This divider is based on the division algorithm of solving Discrete Wiener-Hopf Equation using Gauss-Jordan elimination method. The hardware complexity of the matrix generation part has been reduced dramatically form O(m) to O(m). When it is used as a building block for a large system, this divider can achieve more savings in hardware by utilizing sub-structure sharing techniques.
منابع مشابه
GF(2^m) Multiplication and Division Over the Dual Basis
In this paper an algorithm for GF(2") multiplication/division is presented and a new, more generalized definition of duality is proposed. From these the bit-serial Berlekamp multiplier is derived and shown to be a specific case of a more general class of multipliers. Furthermore, it is shown that hardware efficient, bit-parallel dual basis multipliers can also be designed. These multipliers hav...
متن کاملImplementation of Scalable Elliptic Curve Cryptosystem Crypto - Accelerators for GF ( 2 m ) Aaron
This paper focuses on designing elliptic curve crypto-accelerators in GF (2m) that are cryptographically scalable and hold some degree of reconfigurability. Previous work in elliptic curve crypto-accelerators focused on implementations using projective coordinate systems for specific field sizes. Their performance, scalar point multiplication per second (kP/s), was determined primarily by the u...
متن کاملAn Efficient Multiplier/Divider Design for Elliptic Curve Cryptosystem over GF(2m)
Using the concept of reciprocal polynomial, this paper shows that a field multiplication over GF(2) can be implemented by extended Stein’s algorithm, one of the algorithms used to accomplish division. In this way, a field multiplier can be efficiently embedded into a divider with very little hardware overhead for operand selection based on a fundamental change at the algorithmic level. When app...
متن کاملMontgomery Multiplier and Squarer in GF(2m)
Montgomery multiplication in GF(2m) is defined by a(x)b(x)r 1(x) mod f(x), where the field is generated by irreducible polynomial f(x), a(x) and b(x) are two field elements in GF(2m), and r(x) is a fixed field element in GF(2m). In this paper, first we present a generalized Montgomery multiplication algorithm in GF(2m). Then by choosing r(X) according to f(x), we show that efficient architectur...
متن کاملA low-power bit-serial multiplier for finite fields GF(2m)
This paper presents a bit-serial architecture for efficient addition and multiplication in binary finite fields GF(2m) using a polynomial basis representation. Moreover, a low-voltage/low-power implementation of the arithmetic circuits and the registers is proposed. The introduced multiplier operates over a variety of binary fields up to an order of 2m. We detail that the bit-serial multiplier ...
متن کامل